Randomly colouring graphs (a combinatorial view)
نویسندگان
چکیده
منابع مشابه
Randomly colouring graphs (a combinatorial view)
The application of the probabilistic method to graph colouring has been yielding interesting results for more than 40 years. Several probabilistic tools are presented in this survey, ranging from the basic to the more advanced. For each of them, an application to a graph colouring problem is presented in detail. In this way, not only is the general idea of the method exposed, but also are the c...
متن کاملRandomly colouring random graphs
We consider the problem of generating a colouring of the random graph Gn,p uniformly at random using a natural Markov chain algorithm: the Glauber dynamics. We assume that there are β∆ colours available, where ∆ is the maximum degree of the graph, and we wish to determine the least β = β(p) such that the distribution is close to uniform in O(n log n) steps of the chain. This problem has been pr...
متن کاملOn randomly colouring locally sparse graphs
We consider the problem of generating a random q-colouring of a graph G = (V, E). We consider the simple Glauber Dynamics chain. We show that if for all v ∈ V the average degree of the subgraph Hv induced by the neighbours of v ∈ V is ∆ where ∆ is the maximum degree and ∆ > c1 ln n then for sufficiently large c1, this chain mixes rapidly provided q/∆ > α, where α ≈ 1.763 is the root of α = e. F...
متن کاملRandomly Colouring Graphs with Girth Five and Large Maximum Degree
We prove that the Glauber dynamics on the k-colourings of a graph G on n vertices with girth 5 and maximum degree ∆ ≥ 1000 log n mixes rapidly if k = q∆ and q > β where β = 1.645... is the root of 2− (1− e−1/β)2 − 2βe−1/β = 0.
متن کاملRandomly colouring simple hypergraphs
We study the problem of constructing a (near) random proper q-colouring of a simple k-uniform hypergraph with n vertices and maximum degree ∆. (Proper in that no edge is mono-coloured and simple in that two edges have maximum intersection of size one). We give conditions on q,∆ so that if these conditions are satisfied, Glauber dynamics will converge in O(n log n) time from a random (improper) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Science Review
سال: 2008
ISSN: 1574-0137
DOI: 10.1016/j.cosrev.2008.05.003